P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
141	Microsoft Word - MRP 1 - Copy _2_ Add to Reading List Source URL: www.bamcollege.org Language: English - Date: 2014-05-30 05:17:49 Complexity classes Computability theory Theory of computation Mathematical optimization NP-complete Algorithm P versus NP problem Computability Reduction Theoretical computer science Applied mathematics Computational complexity theory
142	Parent Council Meeting Tuesday, 22nd October[removed]:30pm in the staff room Minutes Add to Reading List Source URL: www.buckstone1.ik.org Language: English - Date: 2014-01-21 07:42:22 Mathematical optimization Complexity classes Conjectures P versus NP problem Structural complexity theory School meal NP Theoretical computer science Mysteries Applied mathematics
143	Example 3: Student work Mathematical Exploration: Minesweeper Used with permission from Microsoft ‘’Minesweeper’’, the common household computer game installed in many Add to Reading List Source URL: library.tedankara.k12.tr Language: English - Date: 2012-11-11 10:24:18 Windows games NP-complete problems Applied mathematics Linux games Mathematical optimization Minesweeper P versus NP problem NP-complete Sudoku Mathematics Theoretical computer science Puzzle video games
144	INFORMATION TECHNOLOGY THE LIMITSOF Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Quantum information science Mathematical optimization Quantum algorithm Quantum computer P versus NP problem NP-complete NP BQP Theoretical computer science Applied mathematics Computational complexity theory
145	The Limits of Quantum Computers (DRAFT) Scott Aaronson For the published version—which differs significantly from this one—please see the March 2008 issue of Scientific American. “Haggar Physicists Develop ‘Quant Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Mathematical optimization Quantum complexity theory NP-complete P versus NP problem Quantum computer Quantum algorithm NP PP Theoretical computer science Applied mathematics Computational complexity theory
146	Max-CSP Semi-Definite programming Inapproximability results Classification On the efficient approximability of constraint Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:55:53 Complexity classes Mathematical optimization Constraint satisfaction problem Approximation algorithm NP-complete P versus NP problem Bounded-error probabilistic polynomial Constraint satisfaction NP Theoretical computer science Computational complexity theory Applied mathematics
147	Interfaces and the Grammar Add to Reading List Source URL: www.lingref.com Language: English - Date: 2013-07-01 12:58:45 Generative linguistics Noam Chomsky Combinatory categorial grammar Categorial grammar P versus NP problem Government and binding theory Syntax Syntactic category Transformational grammar Linguistics Theoretical computer science Grammar
148	Book review of Descriptive Complexity by Neil Immerman (Graduate texts in Computer Science, Springer, [removed]Appeared in the Bulletin of Symbolic Logic vol. 7 no. 4 December, 2001 pages[removed]Overview Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:06 Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory Descriptive complexity theory Mathematical logic P versus NP problem FO P Theoretical computer science Applied mathematics Complexity classes
149	Journal of Machine Learning Research[removed] Submitted 10/02; Published 6/03 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2004-04-06 06:38:40 Complexity classes P versus NP problem Probably approximately correct learning PP NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
150	Information and Computation[removed]–55 www.elsevier.com/locate/ic Add to Reading List Source URL: www.math.nus.edu.sg Language: English - Date: 2003-07-25 20:48:35 Complexity classes Structural complexity theory Closest string String Formal languages NP Substring Hamming distance P versus NP problem Theoretical computer science Mathematics Applied mathematics

UPDATE